151![Remark on “Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound Constrained Optimization” Jos´e Luis Morales∗ Jorge Nocedal Remark on “Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound Constrained Optimization” Jos´e Luis Morales∗ Jorge Nocedal](https://www.pdfsearch.io/img/6888428123e16690f87958843a5615db.jpg) | Add to Reading ListSource URL: www.ece.northwestern.eduLanguage: English - Date: 2011-03-29 13:06:22
|
---|
152![IRRATIONAL NUMBERS ARISING FROM CERTAIN DIFFERENTIAL EQUATIONS M. RAM MURTY AND V. KUMAR MURTY Niven [3] gave a simple proof that π is irrational. Koksma [2] modified Niven’s proof to show that er is irrational for ev IRRATIONAL NUMBERS ARISING FROM CERTAIN DIFFERENTIAL EQUATIONS M. RAM MURTY AND V. KUMAR MURTY Niven [3] gave a simple proof that π is irrational. Koksma [2] modified Niven’s proof to show that er is irrational for ev](https://www.pdfsearch.io/img/879cf11451c729c7dc543e631722c3a9.jpg) | Add to Reading ListSource URL: rinconmatematico.comLanguage: English - Date: 2005-04-23 05:41:16
|
---|
153![A Simple Aggregative Algorithm for Counting Triangulations of Planar Point Sets and Related Problems Victor Alvarez∗ Raimund Seidel† A Simple Aggregative Algorithm for Counting Triangulations of Planar Point Sets and Related Problems Victor Alvarez∗ Raimund Seidel†](https://www.pdfsearch.io/img/9282c31ec33635e2a630d39e546eaa1d.jpg) | Add to Reading ListSource URL: www.victoralvarez.netLanguage: English - Date: 2014-05-29 18:33:05
|
---|
154![Introduction to Computational Geometry Subir Kumar Ghosh Introduction to Computational Geometry Subir Kumar Ghosh](https://www.pdfsearch.io/img/430586f5147e376bac1912475de43124.jpg) | Add to Reading ListSource URL: www.tcs.tifr.res.inLanguage: English - Date: 2010-12-31 05:42:26
|
---|
155![A simple linear-time modular decomposition algorithm for graphs, using order extension? Michel Habib, Fabien de Montgolfier, and Christophe Paul A simple linear-time modular decomposition algorithm for graphs, using order extension? Michel Habib, Fabien de Montgolfier, and Christophe Paul](https://www.pdfsearch.io/img/f0efd32f241de0a8a723c5c67e3e47a4.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2004-03-26 18:32:22
|
---|
156![Curriculum Vitae PERSONAL Name Curriculum Vitae PERSONAL Name](https://www.pdfsearch.io/img/fbda30de2d9229a7e4c8cba4e7390f14.jpg) | Add to Reading ListSource URL: panoramix.ift.uni.wroc.plLanguage: English - Date: 2006-08-04 13:18:00
|
---|
157![A simple algorithm with no simple veri
cation L A simple algorithm with no simple veri
cation L](https://www.pdfsearch.io/img/e8ce95c54dbbeed22e8dca21230e321c.jpg) | Add to Reading ListSource URL: www.renyi.huLanguage: English - Date: 2006-09-06 09:43:02
|
---|
158![How to Resolve SDSI Names Without Closure Sameer Ajmani MIT Computer Science and AI Lab How to Resolve SDSI Names Without Closure Sameer Ajmani MIT Computer Science and AI Lab](https://www.pdfsearch.io/img/45dfd4e25476252c8e4d1eeda4d6ecff.jpg) | Add to Reading ListSource URL: pmg.lcs.mit.eduLanguage: English - Date: 2004-02-28 18:57:41
|
---|
159![Simple and Practical Algorithm for Sparse Fourier Transform Haitham Hassanieh MIT Simple and Practical Algorithm for Sparse Fourier Transform Haitham Hassanieh MIT](https://www.pdfsearch.io/img/c4339e055c335b700db2b47d7e9aa997.jpg) | Add to Reading ListSource URL: www.mit.eduLanguage: English - Date: 2011-10-04 18:45:41
|
---|
160![CANTOR’S DIAGONAL ARGUMENT: PROOF AND PARADOX Cantor’s diagonal method is elegant, powerful, and simple. It has been the source of CANTOR’S DIAGONAL ARGUMENT: PROOF AND PARADOX Cantor’s diagonal method is elegant, powerful, and simple. It has been the source of](https://www.pdfsearch.io/img/871ead4f5be8ead65d34a2d8bc93d4a8.jpg) | Add to Reading ListSource URL: wiki.laptop.orgLanguage: English - Date: 2011-07-28 22:14:56
|
---|